Traversing Probabilistic Graphs
نویسندگان
چکیده
The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are probabilistic in nature. A probabilistic graph is one where there is a probability associated with the existence of every edge. We examine the problem of nding the best strategy for reaching a given target vertex from a start vertex in a probabilistic graph.
منابع مشابه
A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks
We propose a new probabilistic ant-based heuristic (ANTH-LS) for the longest simple cycle problem. This NP-hard problem has numerous real-world applications in complex networks, including efficient construction of graph layouts, analysis of social networks or bioinformatics. Our algorithm is based on reinforcing the probability of traversing the edges, which have not been present in the long cy...
متن کاملConstructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)
The paper constructs a generalized version of universal traversing sequences. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, a sequence is constructed that is used by a finite-automaton with 0(1) states in order to traverse all the n-vertex labeled undirect...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملOn a Simple Depth-First Search Strategy for Exploring Unknown Graphs
We present a simple depth-rst search strategy for exploring (constructing) an unknown strongly connected graph G with m edges and n vertices by traversing at most min(mn; dn 2 + m) edges. Here, d is the minimum number of edges needed to add to G to make it Eulerian. This parameter d is known as the deeciency of a graph and was introduced by Kutten Kut88]. It was conjectured that graphs with low...
متن کاملA Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata
We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff’s “jumping automata for graphs.”
متن کامل